Towards a Noether – like conservation law theorem for one dimensional reversible cellular automata 1

نویسنده

  • Tim Boykett
چکیده

Evidence and results suggesting that a Noether–like theorem for conservation laws in 1D RCA can be obtained. Unlike Noether’s theorem, the connection here is to the maximal congruences rather than the automorphisms of the local dynamics. We take the results of Takesue and Hattori (1992) on the space of additive conservation laws in one dimensional cellular automata. In reversible automata, we show that conservation laws correspond to the null spaces of certain well-structured matrices. It is shown that a class of conservation laws exist that correspond to the maximal congruences of index 2. In all examples investigated, this is all the conservation laws. Thus we conjecture that there is an equality here, corresponding to a Noether–like theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noether Theorem for Μ-symmetries

We give a version of Noether theorem adapted to the framework of μ-symmetries; this extends to such case recent work by Muriel, Romero and Olver in the framework of λ-symmetries, and connects μ-symmetries of a Lagrangian to a suitably modified conservation law. In some cases this “μconservation law” actually reduces to a standard one; we also note a relation between μ-symmetries and conditional...

متن کامل

Number-Conserving Reversible Cellular Automata and Their Computation-Universality

We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the connguration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization o...

متن کامل

Circular Motion of Strings in Cellular Automata, and Other Surprises

A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law. Fig 1: Busy Boxes CA tracing a quasi-circular path

متن کامل

Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata

We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garcı́aRamos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other. However, if we increase the neighborhood size, we can find many complex RNCCAs...

متن کامل

The Most General Conservation Law for a Cellular Automaton

We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and real-valued conservation laws. We prove that, even in one-dimensional case, it is undecidable if a CA has any non-trivial conservation law of each type. For a fixed range, each CA has a most general (group-valued or semigroup-v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003